Controlling Factors in Evaluating Path-sensitive Error Detection Techniques TR-UNL-CSE-2006-0009
نویسندگان
چکیده
Recent advances in static program analysis have made it possible to detect errors in applications that have been thoroughly tested and are in wide-spread use. The ability to find errors that have eluded traditional validation methods is due to the development and combination of sophisticated algorithmic techniques that are embedded in the implementations of analysis tools. Evaluating new analysis techniques is typically performed by running an analysis tool on a collection of subject programs, perhaps enabling and disabling a given technique in different runs. While seemingly sensible, this approach runs the risk of attributing improvements in the cost-effectiveness of the analysis to the technique under consideration, when those improvements may actually be due to details of analysis tool implementations that are uncontrolled during evaluation. In this paper, we focus on the specific class of path-sensitive error detection techniques and identify several factors that can significantly influence the cost of analysis. We show, through careful empirical studies, that the influence of these factors is sufficiently large that, if left uncontrolled, they may lead researchers to improperly attribute improvements in analysis cost and effectiveness. We make several recommendations as to how the influence of these factors can be mitigated when evaluating techniques.
منابع مشابه
A Slice-based Decision Procedure for Type-based Partial Orders TR-UNL-CSE-2010-0004
Automated software verification and path-sensitive program analysis require the ability to distinguish executable program paths from those that are infeasible. To achieve this, program paths are encoded symbolically as a conjunction of constraints and submitted to an SMT solver; satisfiable path constraints are then analyzed further. In this paper, we study type-related constraints that arise i...
متن کاملExploring Parameterized Relational Consistency
Consistency properties and algorithms for achieving them are at the heart of the success of Constraint Programming. For non-binary Constraint Satisfaction Problems (CSPs), the relational-consistency property R(i,j)C of [Dechter and van Beek 1997] may add new non-binary constraints to the constraint network, thus modifying its topology. The domain-filtering properties of [Bessière et al. 2008] f...
متن کاملPruning Heuristics for Path Sensitization in Test Pattern Generation
A powerful combinational path sensitization engine is required for the efficient implementation of tools for test pattern generation, timing analysis, and delay-fault testing. Path sensitization can be posed as a search, in the ndimensional Boolean space, for a consistent assignment of logic values to the circuit nodes which also satisfies a given condition. While the conditions for path sensit...
متن کاملAn Online Survey Framework Using the Life Events Calendar
We describe an online survey framework programmed as a Java applet with a MySQL back-end. Our framework is built specifically as a Event History Calendar for the study of tobacco users and their behavior over a six month period. We introduce the notion of a Life Events Calendar and the relevance of an intelligent survey system in this context. We describe our methods and our component applicati...
متن کاملGenetic influences on core self-evaluations, job satisfaction, and work stress: A behavioral genetics mediated model
In this study we investigated the mediated influence of core self-evaluations (CSE) on employee health problems via job satisfaction and work stress, and the degree to which genetic factors explain these mediated relationships. Based on data obtained from a sample of 594 Swedish twins (114 monozygotic twin pairs and 183 dizygotic twin pairs), conventional path analysis results supported the med...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006